On a parallel machine scheduling problem with equal processing times
نویسندگان
چکیده
منابع مشابه
On a parallel machine scheduling problem with equal processing times
In this paper, we give a polynomial algorithm for problem P | r j , p j = p | f j (C j), where f j is any non-decreasing function such that for any indices i and j, function f i − f j is monotonous, and a polynomial algorithm for problem P | r j , p j = p, D j | max ϕ j (C j), where ϕ j is any non-decreasing function for any j.
متن کاملParallel Machine Problems with Equal Processing Times
The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring an identical execution time. All jobs have to be processed on a set of parallel machines. Preemptions can be either allowed or forbidden. The aim is to construct a feasible schedule such that a given criterion is minimized. For a couple of problems of this type, recently the complexity status has...
متن کاملParallel machine problems with equal processing times: a survey
The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring an identical execution time. All jobs have to be processed on a set of parallel machines. Preemptions can be either allowed or forbidden. The aim is to construct a feasible schedule such that a given criterion is minimized. For a couple of problems of this type, recently the complexity status has...
متن کاملBicriterion scheduling with equal processing times on a batch processing machine
In this paper we consider the problem of scheduling jobs with equal processing times on a single batch processing machine so as to minimize a primary and a secondary criteria. We provide optimal polynomial algorithms for various combinations of the primary and secondary criteria. This is the Pre-Published Version.
متن کاملScheduling Jobs with Equal Processing Times
Whereas the overwhelming majority of scheduling problems appears to be NP-hard, models with equal processing time jobs form a remarkable case which is still open for most problems but it intuitively looks polynomially solvable. The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring an identical execution time p. There are associated a release time rj...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.09.003